منابع مشابه
On Constructing Minimal Formulae
Given a Boolean propositional formula, φ(Xn) over the basis Ω = {∧,∨,¬} we consider the following decision problem: is there a subset of literals, S, for which φ(Xn) ≡ ∧ y∈S y or φ(Xn) ≡ ∨ y∈S y? We prove that the “obvious” Σ p 2 upper bound is sub-optimal and that the problem is decidable in PNP || the class of languages decidable by polynomial time methods allowed to make non-adaptive queries...
متن کاملNear-minimal cubature formulae on the disk
The construction of (near-)minimal cubature formulae on the disk is still a complicated subject on which many results have been published.We restrict ourselves to the case of radial weight functions and make use of a recent connection between cubature and the concept of multivariate spherical orthogonal polynomials to derive a new system of equations defining the nodes and weights of (near-)min...
متن کاملConstructing Fully Symmetriccubature Formulae for The
We construct symmetric cubature formulae of degrees in the 13-39 range for the surface measure on the unit sphere. We exploit a recently published correspondence between cubature formulae on the sphere and on the triangle. Speciically, a fully symmetric cubature formula for the surface measure on the unit sphere corresponds to a symmetric cubature formula for the triangle with weight function (...
متن کاملConstructing interference-minimal networks
We consider the problem of producing interferenceminimal graphs with additional properties such as connectivity, bounded stretch factor or bounded link diameter. We compute exact interference-minimal graphs and estimated interference-minimal graphs. The latter can be computed faster.
متن کاملOn minimal cubature formulae for product weight functions 1
We derive in a simple way certain minimal cubature formulae, obtained by Morrow and Patterson [2], and Xu [4], using a different technique. We also obtain in explicit form new near minimal cubature formulae. Then, as a corollary, we get a compact expression for the bivariate Lagrange interpolation polynomials, based on the nodes of the cubature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2010
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxq050